package main;

import java.io.File;

import edu.uci.ics.jung.graph.event.GraphEvent.Edge;
/**
 * 
 * @author dannysi
 * a class with all the program options
 */
public class ProgramOptions {
	
	public enum EdgeWeight {CHANGING , ALL_1};
	public enum EdgeCount {MORE,LESS};
	public enum UnSplitable {LEAVE,TRY_AGAIN};
	public enum Algorithem {DINIC,CLUSTERING2, CLUSTERING1};
	public enum CutChoise {LARGE,SMALL};
	
	public static EdgeWeight  optionEdgeWeight=EdgeWeight.ALL_1;
	public static EdgeCount  optionEdgeCount=EdgeCount.LESS;	//this is for the last task from Raz
	public static UnSplitable optionUnsplitable=UnSplitable.TRY_AGAIN;
	public static CutChoise cutChoise=CutChoise.LARGE;
	public static int keepTrying=100;
	public static Algorithem algo=Algorithem.DINIC;
	public static String inputFile;
	public static String outputFile;
	public static int numberOfAgents;
	public static int rankLimit;
	public static int edgesToRemove = 6;	//for edge_betwenness_clustering algorithm
	public static String lastInputFolder;
	public static String lastOutputFolder;
	

	

}
